Space Subdivision for Fast Polygonization of Implicit Surfaces
نویسندگان
چکیده
This paper presents the basic principles for the visualization of objects which are defined by implicit functions and CSG trees. The basic principles (Marching cubes, Marching tetrahedra and Marching triangles) for iso-surfaces rendering of such objects are compared. A new fast modification of the Marching triangles algorithm is presented and compared with others algorithms. It is based on the space subdivision technique that enabled a significant speed-up of the Marching triangles algorithm. The speed-up grows with the grid resolution in which the object is represented. The presented algorithm is convenient for objects with large smooth and complex surfaces. The method produces a triangular mesh that consists of well-shaped triangles. 1 project supported by the Ministry of Education of Czech Republic – Project MSM 235200005
منابع مشابه
Subdivision Surfaces for Fast Approximate Implicit Polygonization
We propose a fast method of generating an approximate polygonal mesh from an implicit surface. Current workstations are still not capable of producing polygon meshes fast enough for the interactive modelling of complex implicit models. We propose a hybrid method that combines current implicit polygonization techniques with the faster sub-division surface technique applied as a post-process to s...
متن کاملEdge spinning algorithm for implicit surfaces ✩
This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algor...
متن کاملA Methodology for Piecewise Linear Approximation of Surfaces
We discuss the problem of adaptive polygonization of regular surfaces of the euclidean 3D space, and present effective algorithms for computing optimal polygonizations of surfaces described in parametric or implicit form.
متن کاملDynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features
The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
متن کاملPolygonization of Implicit Surfaces on Multi-Core Architectures with SIMD Instructions
In this research we tackle the problem of rendering complex models which are created using implicit primitives, blending operators, affine transformations and constructive solid geometry in a design environment that organizes all these in a scene graph data structure called BlobTree. We propose a fast, scalable, parallel polygonization algorithm for BlobTrees that takes advantage of multicore p...
متن کامل